//Given an integer array nums, find the contiguous subarray (containing at 
//least one number) which has the largest sum and return its sum. 
//
// A subarray is a contiguous part of an array. 
//
// 
// Example 1: 
//
// 
//Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
//Output: 6
//Explanation: [4,-1,2,1] has the largest sum = 6.
// 
//
// Example 2: 
//
// 
//Input: nums = [1]
//Output: 1
// 
//
// Example 3: 
//
// 
//Input: nums = [5,4,-1,7,8]
//Output: 23
// 
//
// 
// Constraints: 
//
// 
// 1 <= nums.length <= 10⁵ 
// -10⁴ <= nums[i] <= 10⁴ 
// 
//
// 
// Follow up: If you have figured out the O(n) solution, try coding another 
//solution using the divide and conquer approach, which is more subtle. 
// Related Topics Array Divide and Conquer Dynamic Programming 👍 16762 👎 786


package leetcode.editor.en;

public class _53_MaximumSubarray {
    public static void main(String[] args) {
        Solution solution = new _53_MaximumSubarray().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int maxSubArray(int[] nums) {
            int dp = nums[0];
            int max = dp;
            for (int i = 1; i < nums.length; i++) {
                dp = Math.max(dp+nums[i], nums[i]);
                max = Math.max(dp, max);
            }
            return max;
        }

        public int maxSubArray1(int[] nums) {
            int[] dp = new int[nums.length];
            int max = nums[0];
            dp[0] = max;
            for (int i = 1; i < nums.length; i++) {
                dp[i] = Math.max(dp[i-1]+ nums[i], nums[i]);
                max = Math.max(dp[i], max);
            }
            return max;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}